Correction to "Secret Sharing Schemes With Bipartite Access Structure"

نویسندگان

  • Carles Padró
  • Germán Sáez
چکیده

We point out some mistakes in Lemma 5.1 and Proposition 5.2 in our paper. Since we are supposing that a ≤ b, the first and the second statements of Lemma 5.1 are not symmetric. The second one must be corrected to: 2. y r = max{0, (t − aN 1)/b} and x r = (t − by r)/a. Besides, the proof of Lemma 5.1 can be more easily understood by beginning it with the proof of the third statement. Due to this mistake in Lemma 5.1, the statement and the proof of Proposition 5.2 are not correct. Proposition 5.2, which is a characterization of the ideal weighted threshold access structures with two weights, must be changed to: Proposition 5.2 A weighted threshold access structure with two weights Γ = W (a, b, t, N 1 , N 2) is ideal if and only if one of the following situations occurs: • x 1 + y 1 = x r + y r , where x 1 = 0 or y 1 = N 2 , that is, Γ = Ω 4 (n, n 1 , n 2) with n 1 = x r , n 2 = y 1 and n = x 1 + y 1. • r = 2 and x 1 = 0, that is, Γ = Ω 2 (n, n 1 , n 2), where n 1 = x 2 , n 2 = y 1 and n = x 2 + y 2. • r ≥ 3, x 1 = 0, x 2 = 2 and x 2 + y 2 = x r + y r , that is, Γ = Ω 2 (n, n 1 , n 2), where n 1 = x r , n 2 = y 1 and n = n 2 + 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secret Sharing Schemes with Bipartite Access Structure

We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the opt...

متن کامل

On the Optimization of Bipartite Secret Sharing Schemes

Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartite access structures, in which the set of participants is divided in two parts, and all participants in each part play an equivalent role. We focus ...

متن کامل

A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based On Bipartite Graphs of Larger Girth

In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access st...

متن کامل

A Study on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based On Bipartite Graphs

A perfect secret-sharing scheme is a method to distribute a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of participants in any unqualified subset is statistically independent of the secret. The collection of all qualified subsets is called the access structure of the perfect secret-sharing scheme. In a g...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2004